Some embedding theorems for modal logic.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Some Embedding Theorems for Inverse Semigroups

A semilattice decomposition of an inverse semigroup has good internal mapping properties. These are used to give natural proofs of some embedding theorems, which were originally proved in a rather artificial way. The reader is referred to [1] for the basic theory of inverse semigroups. In an earlier paper [3] we proved the following embedding result: (1) An E-unitary inverse semigroup is isomor...

متن کامل

Proving Unprovability in Some Normal Modal Logic

The present communication suggests deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of Lukasiewicz: for every formula φ either ` φ or a φ (but not both) is derivable. In particular, purely syntactic decision procedure is provided for the logics under considera...

متن کامل

Some Characterization Theorems for Infinitary Universal Horn Logic Without Equality

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

متن کامل

Subnormal Embedding Theorems for Groups

In this paper we establish some subnormal embeddings of groups into groups with additional properties; in particular embeddings of countable groups into 2-generated groups with some extra properties. The results obtained are generalizations of theorems of P. Hall, R. Dark, B. Neumann, Hanna Neumann, G. Higman on embeddings of that type. Considering subnormal embeddings of finite groups into fin...

متن کامل

Coding Theorems for Reversible Embedding

We consider embedding of messages (data-hiding) into i.i.d. host sequences. As in Fridrich et al. [2002] we focus on the case where reconstruction of the host sequence from the composite sequence is required. We study the balance between embedding rate and embedding distortion. First we determine the distortion-rate region corresponding to this setup. Then we generalize this result in two direc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1971

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093894226